A Global Constraint for Parallelizing the Execution of Task Sets in Non-Preemptive Scheduling
نویسنده
چکیده
In this paper, we introduce tracks. A track is a global constraint for parallelizing the execution of task sets in non-preemptive scheduling. We give algorithms for bound as well as for domain reasoning, we propose applications in school timetabling, and we report results of a large-scale empirical study. Section 2 introduces concepts and notations we rely on. Section 3 defines tracks in terms of syntax and semantics. Section 4 gives algorithms for solving tracks. Section 5 introduces to school timetabling and section 6 shows how to infer tracks in this setting. Section 7 proposes applications of tracks in school timetabling, presents our experimental design, and reports results. Section 8 closes with perspectives for future work.
منابع مشابه
A Global Constraint for Parallelizing the Execution of Task Sets
We introduce the track parallelization problem (TPP) that consists in parallelizing the execution of task sets. For modelling and solving TPPs in a finite-domain constraintprogramming framework, we propose the TPP constraint along with a suitable solver for use in non-preemptive scheduling. We demonstrate how to infer redundant TPPs in school timetabling and we report a large-scale empirical st...
متن کاملOptimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملModeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems
In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...
متن کاملA Response-Time Analysis for Non-preemptive Job Sets under Global Scheduling
An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of the worst-case execution time (WCET) estimation. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are often too pessimisti...
متن کامل